Probabilistic Rewrite Theories
نویسندگان
چکیده
We propose probabilistic rewrite theories as a general semantic framework supporting highlevel specification of probabilistic systems that can be massively concurrent. We give the definition and semantics of probabilistic rewrite theories and discuss the mappings between different classes of theories and models. We then define the semantics of probabilistic temporal formulae for a given probabilistic rewrite theory. We explain how real-time probabilistic systems whose time is discrete can be expressed as probabilistic rewrite theories without any extension. Finally we give our design ideas for PMaude, an implementation of probabilistic rewrite theories on top of Maude 2.0. We shall report a running prototype of PMaude in the final version of the paper.
منابع مشابه
Probabilistic Real-Time Rewrite Theories and Their Expressive Power
Unbounded data structures, advanced functions and data types, and/or different forms of communication are often needed to model large and complex probabilistic real-time systems such as wireless sensor network algorithms. Furthermore, it is natural to model distributed probabilistic real-time systems in an object-oriented style, including using subclass inheritance and dynamic object and messag...
متن کاملProbabilistic Rewrite Theories: Unifying Models, Logics and Tools
Probabilistic rewrite theories are proposed as a general semantic framework that unifies many existing models of probabilistic systems for both discrete and continuous time and suggests new models such as probabilistic hybrid systems. Probabilistic temporal logics for existing models are likewise unified in two logics, namely PRTL and PRTL∗ that we develop. Having a common semantic framework en...
متن کاملA Probabilistic Strategy Language for Probabilistic Rewrite Theories and Its Application to Cloud Computing
Several formal models combine probabilistic and nondeterministic features. To allow their probabilistic simulation and statistical model checking by means of pseudo-random number sampling, all sources of nondeterminism must first be quantified. However, current tools offer limited flexibility for the user to define how the nondeterminism should be quantified. In this paper, we propose an expres...
متن کاملPVeStA: A Parallel Statistical Model Checking and Quantitative Analysis Tool
Statistical model checking is an attractive formal analysis method for probabilistic systems such as, for example, cyber-physical systems which are often probabilistic in nature. This paper is about drastically increasing the scalability of statistical model checking, and making such scalability of analysis available to tools like Maude, where probabilistic systems can be specified at a high le...
متن کاملFormalization and Simulation of α-Synuclein Aggregation and Propagation under Different Pathobiological Conditions in PSMaude
PSMaude is a probabilistic extension of Maude that provides an expressive probabilistic strategy language to quantify the nondeterminism in probabilistic rewrite theories, allowing the user to specify different probabilistic strategies on top of a base model. In this paper we use PSMaude to define a formal, executable real-time model of the aggregation and interneuronal propagation of the α-syn...
متن کامل